Symbolic bisimulation for the applied pi calculus*

Symbolic Bisimulation for the Applied Pi Calculus

We propose a symbolic semantics for the finite applied pi calculus.The applied pi calculus is a variant of the pi calculus with extensions formodelling cryptographic protocols. By treating inputs symbolically, oursemantics avoids potentially infinite branching of execution trees due toinputs from the environment. Correctness is maintained by associatingwith each process a se...

Symbolic bisimulation for the applied pi calculus ( extended abstract ) ⋆

Recently, we have proposed in [10] a symbolic semantics together with a sound symbolic labelled bisimulation relation for the finite applied pi calculus. By treating inputs symbolically, our semantics avoids potentially infinite branching of execution trees due to inputs from the environment. This work is an important step towards automation of observational equivalence for the finite applied p...

Symbolic Bisimulation for the Applied Pi Calculus * Stéphanie Delaune

We propose a symbolic semantics for the finite applied pi calculus.The applied pi calculus is a variant of the pi calculus with extensions formodelling cryptographic protocols. By treating inputs symbolically, oursemantics avoids potentially infinite branching of execution trees due toinputs from the environment. Correctness is maintained by associatingwith each process a se...

A Complete Symbolic Bisimulation for Full Applied Pi Calculus

On the Reduction of Chocs Bisimulation to pi-Calculus Bisimulation

Chocs and-calculus are two extensions of CCS where, respectively, processes and channels are transmissible values. In previous work we have proposed a formalization of the notion of bisimulation for Chocs. In this paper we suggest a more eeective way to reason about this notion by means of an embedding of Chocs into a richer calculus endowed with a notion ofàctivation' channel which we christen...